The maximum average connectivity among all orientations of a graph
نویسندگان
چکیده
For distinct vertices u and v in a graph G, the connectivity between v, denoted $$\kappa _G(u,v)$$ , is maximum number of internally disjoint u–v paths G. The average $${\overline{\kappa }}(G),$$ taken over all unordered pairs u, Analogously, for directed D, from to _D(u,v)$$ D. }}(D)$$ ordered An orientation G obtained by assigning direction every edge let }}_{\max }(G)$$ denote among orientations In this paper we obtain bounds ratio }(G)/{\overline{\kappa }}(G)$$ graphs given order class graphs. Whenever possible, demonstrate sharpness these bounds. This problem had previously been studied trees. We focus on classes cubic 3-connected graphs, minimally 2-connected 2-trees, maximal outerplanar
منابع مشابه
Shattering, Graph Orientations, and Connectivity
We present a connection between two seemingly disparate fields: VC-theory and graph theory. This connection yields natural correspondences between fundamental concepts in VC-theory, such as shattering and VC-dimension, and well-studied concepts of graph theory related to connectivity, combinatorial optimization, forbidden subgraphs, and others. In one direction, we use this connection to derive...
متن کاملToughness of the Networks with Maximum Connectivity
The stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. As the network begins losing links or nodes, eventually there is a loss in its effectiveness. Thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...
متن کاملA note on "Tenacity of a graph with maximum connectivity"
In this note, we show that one of the arguments used by Moazzami for computing the tenacity of the third Harary graph is wrong and then improve the proof. © 2014 Published by Elsevier B.V.
متن کاملtoughness of the networks with maximum connectivity
the stability of a communication network composed of processing nodes and communication links is of prime importance to network designers. as the network begins losing links or nodes, eventually there is a loss in its effectiveness. thus, communication networks must be constructed to be as stable as possible, not only with respect to the initial disruption, but also with respect to the possible...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2021
ISSN: ['1573-2886', '1382-6905']
DOI: https://doi.org/10.1007/s10878-021-00789-z